Secrecy in Untrusted Networks

We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies and security protocols over distributed, mobile infrastructures, and aims to stand to ambients as the spi calculus stands to ?. We present a type system that separates trusted and untrusted data and code, while allowing safe interactions with untrusted sites. We prove that the type system enforces a privacy property, and show the expressiveness of the calculus via examples and an encoding of the spi calculus

Two Algebraic Process Semantics for Contextual Nets

We show that the so-called 'Petri nets are monoids' approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable non-free monoids of places. The algebraic characterizations of net concurrent computations we provide cover both the collective and the individual token philosophy, uniformly along the two interpretations, and coincide with the classical proposals for place/transition Petri nets in the absence of read-arcs

Network-aware Evaluation Environment for Reputation Systems

Parties of reputation systems rate each other and use ratings to compute reputation scores that drive their interactions. When deciding which reputation model to deploy in a network environment, it is important to find the most suitable model and to determine its right initial configuration. This calls for an engineering approach for describing, implementing and evaluating reputation systems while taking into account specific aspects of both the reputation systems and the networked environment where they will run. We present a software tool (NEVER) for network-aware evaluation of reputation systems and their rapid prototyping through experiments performed according to user-specified parameters. To demonstrate effectiveness of NEVER, we analyse reputation models based on the beta distribution and the maximum likelihood estimation

Defining the role of the Bcl-2 family proteins in Huntington's disease

B-cell lymphoma 2 (Bcl-2) family proteins regulate survival, mitochondria morphology dynamics and metabolism in many cell types including neurons. Huntington's disease (HD) is a neurodegenerative disorder caused by an expanded CAG repeat tract in the IT15 gene that encodes for the protein huntingtin (htt). In vitro and in vivo models of HD and HD patients' tissues show abnormal mitochondrial function and increased cell death rates associated with alterations in Bcl-2 family protein expression and localization. This review aims to draw together the information related to Bcl-2 family protein alterations in HD to decipher their potential role in mutated htt-related cell death and mitochondrial dysfunction

Benefit-cost methodology study with example application of the use of wind generators

An example application for cost-benefit methodology is presented for the use of wind generators. The approach adopted for the example application consisted of the following activities: (1) surveying of the available wind data and wind power system information, (2) developing models which quantitatively described wind distributions, wind power systems, and cost-benefit differences between conventional systems and wind power systems, and (3) applying the cost-benefit methodology to compare a conventional electrical energy generation system with systems which included wind power generators. Wind speed distribution data were obtained from sites throughout the contiguous United States and were used to compute plant factor contours shown on an annual and seasonal basis. Plant factor values (ratio of average output power to rated power) are found to be as high as 0.6 (on an annual average basis) in portions of the central U. S. and in sections of the New England coastal area. Two types of wind power systems were selected for the application of the cost-benefit methodology. A cost-benefit model was designed and implemented on a computer to establish a practical tool for studying the relative costs and benefits of wind power systems under a variety of conditions and to efficiently and effectively perform associated sensitivity analyses

Deriving Bisimulation Congruences: 2-categories vs precategories

G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner’s approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘bunches and wirings.’ We then examine the approach based on Milner’s precategories and Leifer’s functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs

Variable binding, symmetric monoidal closed theories, and bigraphs

This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may express binding operations, in a way reminiscent from higher-order abstract syntax. This theory generates an SMC category S(T) whose morphisms are, in a sense, terms in the desired syntax. We apply our approach to Jensen and Milner's (abstract binding) bigraphs, which are linear w.r.t. processes. This leads to an alternative category of bigraphs, which we compare to the original.Comment: An introduction to two more technical previous preprints. Accepted at Concur '0

Highly Dispersed Few-Nanometer Chlorine-Doped SnO2 Catalyst Embedded in a Polyaniline Matrix for Stable HCOO– Production in a Flow Cell

With the spread of alternative energy plants, electrolysis processes are becoming the protagonists of the future industrial generation. The technology readiness level for the electrochemical reduction of carbon dioxide is still low and is largely based on precious metal resources. In the present work, tin ions are anchored on a polyaniline matrix, via a sonochemical synthesis, forming a few atomic layers of chlorine-doped SnO2 with a total loading of tin atom load of only 7 wt %. This catalyst is able to produce formate (HCOO-) with great selectivity, exceeding 72% of Faradaic efficiency in the first hour of testing in 1 M KHCO3 electrolyte, with a current density of more than 50 mA cm-2 in a 2 M KHCO3 electrolyte flow cell setup. Catalyst stability tests show a stable production of HCOO- during 6 h of measurement, accumulating an overall TONHCOO- of more than 10,000 after 16 h of continuous formate production. This strategy is competitive in drastically reducing the amount of metal required for the overall catalysis

PBFT vs proof-of-authority: Applying the CAP theorem to permissioned blockchain

Permissioned blockchains are arising as a solution to federate companies prompting accountable interactions. A variety of consensus algorithms for such blockchains have been proposed, each of which has different benefits and drawbacks. Proof-of-Authority (PoA) is a new family of Byzantine fault-tolerant (BFT) consensus algorithms largely used in practice to ensure better performance than traditional Practical Byzantine Fault Tolerance (PBFT). However, the lack of adequate analysis of PoA hinders any cautious evaluation of their effectiveness in real-world permissioned blockchains deployed over the Internet, hence on an eventually synchronous network experimenting Byzantine nodes. In this paper, we analyse two of the main PoA algorithms, named Aura and Clique, both in terms of provided guarantees and performances. First, we derive their functioning including how messages are exchanged, then we weight, by relying on the CAP theorem, consistency, availability and partition tolerance guarantees. We also report a qualitative latency analysis based on message rounds. The analysis advocates that PoA for permissioned blockchains, deployed over the Internet with Byzantine nodes, do not provide adequate consistency guarantees for scenarios where data integrity is essential. We claim that PBFT can fit better such scenarios, despite a limited loss in terms of performance